Embedding Heuristic Rules in RRT Path Planning of Excavators
نویسنده
چکیده
Improving safety and productivity of earthwork operations is of paramount importance, especially in congested sites where collisions are more probable. Automated Machine Guidance and Control technology is expected to improve both safety and productivity of earthwork operations by providing excavator operators with higher level of support regarding the path planning of excavators based on site conditions. However, in spite of the large number of studies related to automated path planning of excavators using well established algorithms from robotics, such as Rapidly-exploring Random Tree (RRT) and Probabilistic Roadmaps (PRM). These studies do not fully consider the engineering constrains of the equipment and do not result in smooth and optimal paths that can be applied in
منابع مشابه
Potential functions based sampling heuristic for optimal path planning
Rapidly-exploring Random Tree Star(RRT*) is a recently proposed extension of Rapidly-exploring Random Tree (RRT) algorithm that provides a collisionfree, asymptotically optimal path regardless of obstacles geometry in a given environment. However, one of the limitation in the RRT* algorithm is slow convergence to optimal path solution. As a result it consumes high memory as well as time due to ...
متن کاملA Multi-stage Probabilistic Algorithm for Dynamic Path-Planning
Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidlyexploring Random Trees (RRTs) in particular have been shown to be efficient in solving high dimensional problems. Even though several RRT variants have been proposed for dynamic replanning, these methods only perform well in environments with infrequent changes. This paper addresses the d...
متن کاملIntelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments
The sampling based motion planning algorithm known as Rapidly-exploring Random Trees (RRT) has gained the attention of many researchers due to their computational efficiency and effectiveness. Recently, a variant of RRT called RRT* has been proposed that ensures asymptotic optimality. Subsequently its bidirectional version has also been introduced in the literature known as Bidirectional-RRT* (...
متن کاملReal-time randomized path planning for robot navigation
Mobile robots often find themselves in a situation where they must find a trajectory to another position in their environment, subject to constraints posed by obstacles and the capabilities of the robot itself. This is the problem of planning a path through a continuous domain, for which several approaches have been developed. Each has some limitations however, including requiring state discret...
متن کاملRrt-hx: Rrt with Heuristic Extend Operations for Motion Planning in Robotic Systems
This paper presents a sampling-based method for path planning in robotic systems without known cost-to-go information. It uses trajectories generated from random search to heuristically learn the cost-to-go of regions within the configuration space. Gradually, the search is increasingly directed towards lower cost regions of the configuration space, thereby producing paths that converge towards...
متن کامل